Simplification of Reaction Networks, Confluence and Elementary Modes
نویسندگان
چکیده
منابع مشابه
Simplification of Reaction Networks, Confluence and Elementary Modes
Reaction networks can be simplified by eliminating linear intermediate species in partial steady states. In this paper, we study the question whether this rewrite procedure is confluent, so that for any given reaction network with kinetic constraints, a unique normal form will be obtained independently of the elimination order. We first show that confluence fails for the elimination of intermed...
متن کاملStructural Simplification of Chemical Reaction Networks Preserving Deterministic Semantics
We study the structural simplification of chemical reaction networks preserving the deterministic kinetics. We aim at finding simplification rules that can eliminate intermediate molecules while preserving the dynamics of all others. The rules should be valid even though the network is plugged into a bigger context. An example is Michaelis-Menten’s simplification rule for enzymatic reactions. I...
متن کاملStructural simplification of chemical reaction networks in partial steady states
We study the structural simplification of chemical reaction networks with partial steady state semantics assuming that the concentrations of some but not all species are constant. We present a simplification rule that can eliminate intermediate species that are in partial steady state, while preserving the dynamics of all other species. Our simplification rule can be applied to general reaction...
متن کاملassessment of deep word knowledge in elementary and advanced iranian efl learners: a comparison of selective and productive wat tasks
testing plays a vital role in any language teaching program. it allows teachers and stakeholders, including program administrators, parents, admissions officers and prospective employers to be assured that the learners are progressing according to an accepted standard (douglas, 2010). the problems currently facing language testers have both practical and theoretical implications but the first i...
Practical simplification of elementary functions using CAD
Simplification has been long recognised to be a fundamental problem within computer algebra. One of the main concerns of this paper is to investigate the feasibility of the simplification system proposed by the authors in ISSAC 2004. This will be based on a set of examples which one would might realistically meet in practice. Cylindrical Algebraic Decomposition (CAD) is an integral part of this...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computation
سال: 2017
ISSN: 2079-3197
DOI: 10.3390/computation5010014